On Finding and Enumerating Maximal and Maximum k-Partite Cliques in k-Partite Graphs
نویسندگان
چکیده
منابع مشابه
On finding k-cliques in k-partite graphs
In this paper, a branch-and-bound algorithm for finding all cliques of size k in a kpartite graph is proposed that improves upon the method of Grunert et al (2002). The new algorithm uses bit-vectors, or bitsets, as the main data structure in bit-parallel operations. Bitsets enable a new form of data representation that improves branching and backtracking of the branch-and-bound procedure. Nume...
متن کاملFinding all k-cliques in k-partite graphs, an application in textile engineering
In many practical cases one has to choose an arrangement of di!erent objects so that they are compatible. Whenever the compatibility of the objects can be checked by a pair-wise comparison the problem can be modelled using the graph}theoretic notion of cliques. We consider a special case of the problem where the objects can be grouped so that exactly one object in every group has to be chosen. ...
متن کاملCLICK: Clustering Categorical Data using K-partite Maximal Cliques
Clustering is one of the central data mining problems and numerous approaches have been proposed in this field. However, few of these methods focus on categorical data. The categorical techniques that do exist have significant shortcomings in terms of performance, the clusters they detect, and their ability to locate clusters in subspaces. This work introduces a novel algorithm called Click, wh...
متن کاملThe median problem on k-partite graphs
In a connected graph G, the status of a vertex is the sum of the distances of that vertex to each of the other vertices in G. The subgraph induced by the vertices of minimum (maximum) status in G is called the median (anti-median) of G. The median problem of graphs is closely related to the optimization problems involving the placement of network servers, the core of the entire networks. Bipart...
متن کاملScore Sets in Oriented k - partite Graphs
Let D(U1, U2, ..., Uk) be an oriented k -partite graph with |Ui| = ni, 1 ≤ i ≤ k. Then, the score of a vertex ui in Ui is defined by aui (or simply ai ) = ∑k t=1, t 6=i nt+d + ui −d − ui , where d+ui and d − ui are respectively the outdegree and indegree of ui. The set A of distinct scores of the vertices of D(U1, U2, ..., Uk) is called its score set. In this paper, we prove that if a1 is a non...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2019
ISSN: 1999-4893
DOI: 10.3390/a12010023